The critical pulling force for self-avoiding walks

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Pulling adsorbed self-avoiding walks from a surface

We consider a self-avoiding walk model of polymer adsorption where the adsorbed polymer can be desorbed by the application of a force, concentrating on the case of the square lattice. Using series analysis methods we investigate the behaviour of the free energy of the system when there is an attractive potential with the surface and a force f applied at the last vertex, normal to the surface, a...

متن کامل

Anisotropic Self - Avoiding Walks

We consider a model of self-avoiding walks on the lattice Zd with different weights for steps in each of the 2d lattice directions. We find that the directiondependent mass for the two-point function of this model has three phases: mass positive in all directions; mass identically −∞; and masses of different signs in different directions. The final possibility can only occur if the weights are ...

متن کامل

Prudent Self-Avoiding Walks

We have produced extended series for prudent self-avoiding walks on the square lattice. These are subsets of self-avoiding walks. We conjecture the exact growth constant and critical exponent for the walks, and show that the (anisotropic) generating function is almost certainly not differentiably-finite.

متن کامل

Extendable Self-avoiding Walks

The connective constant μ of a graph is the exponential growth rate of the number of n-step self-avoiding walks starting at a given vertex. A self-avoiding walk is said to be forward (respectively, backward) extendable if it may be extended forwards (respectively, backwards) to a singly infinite self-avoiding walk. It is called doubly extendable if it may be extended in both directions simultan...

متن کامل

Counting Self-avoiding Walks

The connective constant μ(G) of a graph G is the asymptotic growth rate of the number of self-avoiding walks on G from a given starting vertex. We survey three aspects of the dependence of the connective constant on the underlying graph G. Firstly, when G is cubic, we study the effect on μ(G) of the Fisher transformation (that is, the replacement of vertices by triangles). Secondly, we discuss ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Physics A: Mathematical and Theoretical

سال: 2015

ISSN: 1751-8113,1751-8121

DOI: 10.1088/1751-8113/48/16/16ft03